Cluster Scheduling for Data Centers
نویسندگان
چکیده
منابع مشابه
Near - Data Scheduling for Data Centers with Multiple
Data locality is a fundamental issue for data-parallel applications. Considering MapReduce in Hadoop, the map task scheduling part requires an efficient algorithm which takes data locality into consideration; otherwise, the system may become unstable under loads inside the system’s capacity region and jobs may experience longer completion times which are not of interest. The data chunk needed f...
متن کاملEnergy Aware Task Scheduling in Data Centers
Nowadays energy consumption problem is a major issue for data centers. The energy consumption increases significantly along with its CPU frequency getting higher. With Dynamic Voltage and Frequency Scaling (DVFS) techniques, CPU could be set to a suitable working frequency during the running time according to the workload. On the other side, reducing frequency implies that more servers will be ...
متن کاملInformation-Agnostic Flow Scheduling for Commodity Data Centers
Many existing data center network (DCN) flow scheduling schemes minimize flow completion times (FCT) based on prior knowledge of flows and custom switch functions, making them superior in performance but hard to use in practice. By contrast, we seek to minimize FCT with no prior knowledge and existing commodity switch hardware. To this end, we present PIAS1, a DCN flow scheduling mechanism that...
متن کاملCostly Circuits, Submodular Schedules: Hybrid Switch Scheduling for Data Centers
Hybrid switching – in which a high bandwidth circuit switch(optical or wireless) is used in conjunction with a low band-width packet switch – is a promising alternative to inter-connect servers in today’s large scale data-centers. Circuitswitches offer a very high link rate, but incur a non-trivialreconfiguration delay which makes their scheduling challeng-ing. In this p...
متن کاملA cluster centers initialization method for clustering categorical data
Keywords: The k-modes algorithm Initialization method Initial cluster centers Density Distance a b s t r a c t The leading partitional clustering technique, k-modes, is one of the most computationally efficient clustering methods for categorical data. However, the performance of the k-modes clustering algorithm which converges to numerous local minima strongly depends on initial cluster centers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queue
سال: 2017
ISSN: 1542-7730,1542-7749
DOI: 10.1145/3155112.3173558